Automorphism group of a free group: Centralizers and stabilizers

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congruence Subgroups of the Automorphism Group of a Free Group

Let n ≥ 2 and Fn be the free group of rank n. Its automorphism group Aut(Fn) has a well-known surjective linear representation ρ : Aut(Fn) −→ Aut(Fn/F ′ n) = GLn(Z) where F ′ n denotes the commutator subgroup of Fn. By Aut (Fn) := ρ(SLn(Z)) we denote the special automorphism group of Fn. For an epimorphism π : Fn → G of Fn onto a finite group G we call Γ(G, π) := {φ ∈ Aut(Fn) | πφ = π} the stan...

متن کامل

The Automorphism Tower of a Free Group

We prove that the automorphism group of any non-abelian free group F is complete. The key technical step in the proof: the set of all conjugations by powers of primitive elements is first-order parameter-free definable in the group Aut(F ). Introduction In 1975 J. Dyer and E. Formanek [2] had proved that the automorphism group of a finitely generated non-abelian free group F is complete (that i...

متن کامل

Square-free Rings and Their Automorphism Group

Finite-dimensional square-freeK-algebras have been completely characterized by Anderson and D’Ambrosia as certain semigroup algebras A ∼= KξS over a square-free semigroup S twisted by some ξ ∈ Z (S,K), a two-dimensional cocycle of S with coefficients in the group of units K∗ of K. D’Ambrosia extended the definition of square-free to artinian rings with unity and showed every square-free ring ha...

متن کامل

AUTOMORPHISM GROUP OF GROUPS OF ORDER pqr

H"{o}lder in 1893 characterized all groups of order $pqr$ where  $p>q>r$ are prime numbers. In this paper,  by using new presentations of these groups, we compute their full automorphism group.

متن کامل

THE AUTOMORPHISM GROUP OF FINITE GRAPHS

Let G = (V,E) be a simple graph with exactly n vertices and m edges. The aim of this paper is a new method for investigating nontriviality of the automorphism group of graphs. To do this, we prove that if |E| >=[(n - 1)2/2] then |Aut(G)|>1 and |Aut(G)| is even number.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1992

ISSN: 0021-8693

DOI: 10.1016/s0021-8693(05)80041-9